Tabu search algorithm for RP selection in PIM-SM multicast routing

To construct a multicast tree is the basis of multicast data transmission. The prime problem concerning the construction of a shared multicast tree is to determine the position of the root of the shared tree, which is the center selection problem. The selection of the center directly affects the structure of the tree, and affects the performance of multicast accordingly. The center selection problem is an NPC problem. This paper proposes a multicast RP selection algorithm based on tabu search. This algorithm selects RP by considering cost and delay. Simulation results show that good performance is achieved in multicast cost, delay from end to end and register delay. Key-Words: PIM-SM; RP Selection; Group-Based; Tabu Search; Optimization